package K次取反后最大化的数组和;

/**
 * @author: AirMan
 * @date: 2025/4/23 10:34
 * @description:
 */
public class Test {
    public static void main(String[] args) {

        int[] nums = new int[]{2,-3,-1,5,-4};

        Solution solution = new Solution();

        System.out.println(solution.largestSumAfterKNegations(nums, 2));
    }
}
